Connected Treewidth and Connected Graph Searching
نویسندگان
چکیده
Goal In a contaminated network, an invisible omniscient arbitrary fast fugitive ; a team of searchers ; We want to find a strategy that catch the fugitive using the fewest searchers as possible. Goal In a contaminated network, an invisible omniscient arbitrary fast fugitive ; a team of searchers ; We want to find a strategy that catch the fugitive using the fewest searchers as possible.
منابع مشابه
Monotony Properties of Connected Visible Graph Searching
Search games are attractive for their correspondence with classical width parameters. For instance, the invisible search number (a.k.a. node search number) of a graph is equal to its pathwidth plus 1, and the visible search number of a graph is equal to its treewidth plus 1. The connected variants of these games ask for search strategies that are connected, i.e., at every step of the strategy, ...
متن کاملSufficient conditions for maximally edge-connected and super-edge-connected
Let $G$ be a connected graph with minimum degree $delta$ and edge-connectivity $lambda$. A graph ismaximally edge-connected if $lambda=delta$, and it is super-edge-connected if every minimum edge-cut istrivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree.In this paper, we show that a connected graph or a connected triangle-free graph is maximall...
متن کاملTreewidth of Cartesian Products of Highly Connected Graphs
The following theorem is proved: For all k-connected graphs G and H each with at least n vertices, the treewidth of the cartesian product of G and H is at least k(n − 2k + 2) − 1. For n ≫ k this lower bound is asymptotically tight for particular graphs G and H . This theorem generalises a well known result about the treewidth of
متن کاملTransversals of Longest Paths
Let lpt(G) be the minimum cardinality of a set of vertices that intersects all longest paths in a graph G. Let ω(G) be the size of a maximum clique in G, and tw(G) be the treewidth of G. We prove that lpt(G) ≤ max{1,ω(G)− 2} when G is a connected chordal graph; that lpt(G) = 1 when G is a connected bipartite permutation graph or a connected full substar graph; and that lpt(G) ≤ tw(G) for any co...
متن کاملOn giant components and treewidth in the layers model
Given an undirected n-vertex graph G(V,E) and an integer k, let Tk(G) denote the random vertex induced subgraph of G generated by ordering V according to a random permutation π and including in Tk(G) those vertices with at most k − 1 of their neighbors preceding them in this order. The distribution of subgraphs sampled in this manner is called the layers model with parameter k. The layers model...
متن کامل